Maximal arc partitions of designs
نویسندگان
چکیده
It is known that the designs PGn−1(n, q) in some cases have spreads of maximal -arcs. Here a -arc is a non-empty subset of points that meets every hyperplane in 0 or points. The situation for designs in general is not so well known. This paper establishes an equivalence between the existence of a spread of -arcs in the complement of a Hadamard design and the existence of an affine design and a symmetric design which is also the complement of a Hadamard design. © 2005 Elsevier B.V. All rights reserved. MSC: 51E05
منابع مشابه
Hilly poor noncrossing partitions and (2, 3)-Motzkin paths
A hilly poor noncrossing partition is a noncrossing partition with the properties : (1) each block has at most two elements, (2) in its linear representation, any isolated vertex is covered by some arc. This paper defines basic pairs as a combinatorial object and gives the number of hilly poor noncrossing partitions with n blocks, which is closely related to Maximal Davenport-Schinzel sequences...
متن کاملOn Sets with Few Intersection Numbers in Finite Projective and Affine Spaces
In this paper we study sets X of points of both affine and projective spaces over the Galois field GF(q) such that every line of the geometry that is neither contained in X nor disjoint from X meets the set X in a constant number of points and we determine all such sets. This study has its main motivation in connection with a recent study of neighbour transitive codes in Johnson graphs by Liebl...
متن کاملStrict Partitions of Maximal Projective Degree
The projective degrees of strict partitions of n were computed for all n ≤ 100 and the partitions with maximal projective degree were found for each n. It was observed that maximizing partitions for successive values of n “lie close to each other” in a certain sense. Conjecturing that this holds for larger values of n, the partitions of maximal degree were computed for all n ≤ 220. The results ...
متن کاملHardware Index to Set Partition Converter
We demonstrate, for the first time, high-speed circuits that generate partitions on a set S of n objects. We offer two versions. In the first, partitions are produced in lexicographical order in response to successive clock pulses. In the second, an index input determines the set partition produced. Such circuits are needed in the hardware implementation of the optimum distribution of tasks to ...
متن کاملCrossings and Nestings for Arc-Coloured Permutations
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set partitions given by Krattenthaler, also by Chen, Deng, Du, Stanley, and Yan, and for permutations given by Burrill, Mishna, and Post involved passing through...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 294 شماره
صفحات -
تاریخ انتشار 2005